Sub-Optimal Allocation of Time in Sequential Movements
نویسندگان
چکیده
منابع مشابه
Sub-Optimal Allocation of Time in Sequential Movements
The allocation of limited resources such as time or energy is a core problem that organisms face when planning complex actions. Most previous research concerning planning of movement has focused on the planning of single, isolated movements. Here we investigated the allocation of time in a pointing task where human subjects attempted to touch two targets in a specified order to earn monetary re...
متن کاملOptimal Adaptive Policies for Sequential Allocation Problems
p Ž . 0 Ž . Ž . Ž . V u under any policy p in C is equal to nm* u y M u log n q o log n , as n R Ž . Ž . Ž . n a `, where m* u is the largest population mean and M u is a constant. ii Policies in C are asymptotically optimal within a larger class C of ‘‘uniformly R UF 0 p Ž Ž . Ž .. fast convergent’’ policies in the sense that limna ` nm* u y V u r n Ž Ž . pŽ .. Ž . nm* u y V u F 1, for any p g...
متن کاملA Social Welfare Optimal Sequential Allocation Procedure
We consider a simple sequential allocation procedure for sharing indivisible items between agents in which agents take turns to pick items. Supposing additive utilities and independence between the agents, we show that the expected utility of each agent is computable in polynomial time. Using this result, we prove that the expected utilitarian social welfare is maximized when agents take altern...
متن کاملComputing Optimal Sequential Allocation Rules in Clinical Trials*
Michael N. Katehakis State University of New York at Stony Brook and Cyrus Derman Columbia University The problem of assigning one of several treatments in clinical trials is formulated as a discounted bandit problem that was studied by Gittins and Jones. The problem involves comparison of certain state dependent indices A recent characterization of the index is used to calculate more efficient...
متن کاملOptimal Register Allocation in Polynomial Time
A graph-coloring register allocator that optimally allocates registers for structured programs in polynomial time is presented. It can handle register aliasing. The assignment of registers is optimal with respect to spill and rematerialization costs, register preferences and coalescing. The register allocator is not restricted to programs in SSA form or chordal interference graphs. It requires ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLoS ONE
سال: 2009
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0008228